Strategic Planning through Model Checking of ATL Formulae

نویسنده

  • Wojciech Jamroga
چکیده

Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize traditional game trees. The paper ends with suggestions about other game theory concepts that can be transfered to ATL-based planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategic planning for probabilistic games with incomplete information

Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many variants of ATL study a setting where strategies may only take available information into account [7]. Another generalization of ATL is Probabilistic ATL [4], where strategies achieve their goal with a certain probability. ...

متن کامل

Model Checking GDL through MOCHA: A Case Study

The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just to play a specific game. Software participants in the competition are provided with a game specified in GDL, and then required to play this game, interpr...

متن کامل

Approximating Strategic Abilities under Imperfect Information: a Naive Approach

Alternating-time temporal logic (ATL) allows to specify requirements onn abilities that different agents should (or should not) possess in a multi-agent system. However, model checking ATL specifications in realistic systems is computationally hard. In particular, if the agents don’t have perfect information about the global state of the system, the complexity ranges from Delta2P to undecidable...

متن کامل

Refining and Delegating Strategic Ability in ATL

We propose extending Alternating-time Temporal Logic (ATL) by an operator 〈i ⊑ Γ〉φ to express that i can distribute its powers to a set of sub-agents Γ in a way which satisfies ATL condition φ on the strategic ability of the coalitions they may form, possibly together with others agents. We prove the decidability of model-checking of formulas whose 〈. ⊑ .〉-subformulas have the form 〈i1 ⊑ Γ1〉 . ...

متن کامل

Knowledge as Strategic Ability

The ultimate goal of our research is to develop techniques for model checking knowledge properties of multi-agent systems. ATEL, an extension of the Alternating-time Temporal Logic of Alur et al, is a logic for specifying epistemic and strategic properties of such systems. We present a technique for reducing the ATEL model checking problem to one of model checking in ATL, whereby epistemic rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004